Integral Complete Split Graphs
نویسندگان
چکیده
We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.
منابع مشابه
On distance integral graphs
The distance eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and they form the distance spectrum of G. A graph is called distance integral if its distance spectrum consists entirely of integers. We show that no nontrivial tree can be distance integral. We characterize distance integral graphs in the classes of graphs similar to complete split graphs, which, toge...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملComplexity of Steiner Tree in Split Graphs - Dichotomy Results
Given a connected graph G and a terminal set R ⊆ V (G), Steiner tree asks for a tree that includes all of R with at most r edges for some integer r ≥ 0. It is known from [ND12,Garey et. al [1]] that Steiner tree is NP-complete in general graphs. Split graph is a graph which can be partitioned into a clique and an independent set. K. White et. al [2] has established that Steiner tree in split gr...
متن کاملOn Integral Complete R−partite Graphs
A graph G is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper we investigate integral complete r−partite graphs Kp1,p2,...,pr = Ka1p1,a2p2,...,asps with s ≤ 4. New sufficient conditions for complete 3-partite graphs and complete 4-partite graphs to be integral are given. From these conditions we construct infinitely many new classes of integral complete...
متن کاملHamiltonian Path in Split Graphs- a Dichotomy
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the Hamiltonian path problem in $K_{1,4}$-free spl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007